Fast Evaluation of Multi-source Star Twig Queries in a Path Materialization-based XML Database

نویسندگان

  • Erwin Leonardi
  • Sourav S Bhowmick
  • Fengrong Li
چکیده

Despite a large body of work on xml twig query processing in relational environment, systematic study of xml join evaluation has received little attention in the literature. In this paper, we propose a novel and non-traditional technique for fast evaluation of multi-source star twig queries in a path materialization-based rdbms. A multi-source star twig joins different xml documents on values in their nodes and the XQuery graph takes a star-shaped structure. Such queries are prevalent in several domains such as life sciences. Rather than following the conventional approach of generating one huge complex sql query from a twig query, we translate a star query into a list of sql sub-queries that only materializes minimal information of underlying xml subtrees as intermediate results. We have implemented this scheme on top of a path materialization-based xml storage system called Sucxent++. Experiments carried out confirm that our proposed approach built on top of an off-the-shelf commercial rdbms has excellent real-world performance.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Stars on Steroids: Fast Evaluation of Multi-source Star Twig Queries in RDBMS

Despite a large body of work on XML twig query processing in relational environment, systematic study of XML join evaluation has received little attention in the literature. In this paper, we propose a novel and non-traditional technique for fast evaluation of multi-source star twig queries in a path materialization-based RDBMS. A multi-source star twig joins different XML documents on values i...

متن کامل

Answering XML Twig Queries with Automata

XML is emerging as a de facto standard for information representation and data exchange over the web. Evaluation of twig queries, which allows users to find all occurrence of a multiple branch pattern in an XML database, is a core and complicate operation for XML query processing. Performance of conventional evaluation approaches based on structural join declines with the expansion of data size...

متن کامل

Apply Uncertainty in Document-Oriented Database (MongoDB) Using F-XML

As moving to big data world where data is increasing in unstructured way with high velocity, there is a need of data-store to store this bundle amount of data. Traditionally, relational databases are used which are now not compatible to handle this large amount of data, so it is needed to move on to non-relational data-stores. In the current study, we have proposed an extension of the Mongo...

متن کامل

QuickStack: A Fast Algorithm for XML Query Matching

With the increasing popularity of XML for data representation and exchange, much research has been done for providing an efficient way to evaluate twig patterns in an XML database. As a result, many holistic join algorithms have been developed, most of which are derivatives of the well-known TwigStack algorithm. However, these algorithms still apply a two phase processing scheme: first identify...

متن کامل

Apply Uncertainty in Document-Oriented Database (MongoDB) Using F-XML

As moving to big data world where data is increasing in unstructured way with high velocity, there is a need of data-store to store this bundle amount of data. Traditionally, relational databases are used which are now not compatible to handle this large amount of data, so it is needed to move on to non-relational data-stores. In the current study, we have proposed an extension of the Mongo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013